On Algorithm-Dependent Boundary Case Identification for Problem Classes
نویسندگان
چکیده
Running time analysis of metaheuristic search algorithms has attracted a lot of attention. When studying a metaheuristic algorithm over a problem class, a natural question is what are the easiest and the hardest cases of the problem class. The answer can be helpful for simplifying the analysis of an algorithm over a problem class as well as understanding the strength and weakness of an algorithm. This algorithm-dependent boundary case identification problem is investigated in this paper. We derive a general theorem for the identification, and apply it to a case that the (1+1)-EA with mutation probability less than 0.5 is used over the problem class of pseudo-Boolean functions with a unique global optimum.
منابع مشابه
An Algorithm based on Predicting the Interface in Phase Change Materials
Phase change materials are substances that absorb and release thermal energy during the process of melting and freezing. This characteristic makes phase change material (PCM) a favourite choice to integrate it in buildings. Stephan problem including melting and solidification in PMC materials is an practical problem in many engineering processes. The position of the moving boundary, its veloci...
متن کاملکنترل بهینة شار حرارتی سطحی در یک جسم دوبعدی با خواص وابسته به دما
In this paper the optimal control of boundary heat flux in a 2-D solid body with an arbitrary shape is performed in order to achieve the desired temperature distribution at a given time interval. The boundary of the body is subdivided into a number of components. On each component a time-dependent heat flux is applied which is independent of the others. Since the thermophysical properties are t...
متن کاملInverse Sturm-Liouville problems with transmission and spectral parameter boundary conditions
This paper deals with the boundary value problem involving the differential equation ell y:=-y''+qy=lambda y, subject to the eigenparameter dependent boundary conditions along with the following discontinuity conditions y(d+0)=a y(d-0), y'(d+0)=ay'(d-0)+b y(d-0). In this problem q(x), d, a , b are real, qin L^2(0,pi), din(0,pi) and lambda is a parameter independent of x. By defining a new...
متن کاملطبقهبندی زیرپیکسلی تصاویر ابرطیفی براساس تعمیم الگوریتم معاوضه پیکسلی و ارزیابی آن
The capability of the matter identification is developed considerably in hyperspectral images. The spectral reflectance of surfaces in these imaging systems in the visible and near infrared range of the electromagnetic spectrum is recorded in extremely narrow and continuous bands. But for some reasons, such as existence the mixed pixels and low spatial resolution of these images, is difficult t...
متن کاملAbout One Sweep Algorithm for Solving Linear-Quadratic Optimization Problem with Unseparated Two-Point Boundary Conditions
In the paper a linear-quadratic optimization problem (LCTOR) with unseparated two-point boundary conditions is considered. To solve this problem is proposed a new sweep algorithm which increases doubles the dimension of the original system. In contrast to the well-known methods, here it refuses to solve linear matrix and nonlinear Riccati equations, since the solution of such multi-point optimi...
متن کامل